Maximum Planar Subgraphs in Dense Graphs
نویسندگان
چکیده
Kühn, Osthus and Taraz showed that for each γ > 0 there exists C such that any n-vertex graph with minimum degree γn contains a planar subgraph with at least 2n−C edges. We find the optimum value of C for all γ < 1/2 and sufficiently large n.
منابع مشابه
Maximum Planar Subgraphs and Nice Embeddings :
In automatic graph drawing a given graph has to be layed-out in the plane, usually according to a number of topological and aesthetic constraints. Nice drawings for sparse nonplanar graphs can be achieved by determining a maximum planar subgraph and augmenting an embedding of this graph. This approach appears to be of limited value in practice, because the maximum planar subgraph problem is NP-...
متن کاملMaximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs
We study the node-deletion problem consisting of finding a maximum weighted induced bipartite subgraph of a planar graph with maximum degree three. We show that this is polynomially solvable. It was shown in [4] that it is NP-complete if the maximum degree is four. We also extend these ideas to the problem of balancing signed graphs. We also consider maximum weighted induced acyclic subgraphs o...
متن کاملLarge planar subgraphs in dense graphs
We prove sufficient and essentially necessary conditions in terms of the minimum degree for a graph to contain planar subgraphs with many edges. For example, for all positive γ every sufficiently large graph G with minimum degree at least (2/3 + γ)|G| contains a triangulation as a spanning subgraph, whereas this need not be the case when the minimum degree is less than 2|G|/3.
متن کاملUniversal Graphs for Bounded-Degree Trees and Planar Graphs
How small can a graph be that contains as subgraphs all trees on n vertices with maximum degree d? In this paper, this question is answered by constructing such universal graphs that have n vertices and bounded degree (depending only on d). Universal graphs with n vertices and O(n log n) edges are also constructed that contain all bounded-degree planar graphs on n vertices as subgraphs. In gene...
متن کامل08191 Working Group Report - X-graphs of Y-graphs and their Representations
We address graph decomposition problems that help the hybrid visualization of large graphs, where different graphic metaphors (node-link, matrix, etc.) are used in the same picture. We generalize the X -graphs of Y-graphs model introduced in [1] to formalize the problem of automatically identifying dense subgraphs (Y-graphs, clusters) that are prone to be collapsed and shown with a matricial re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 20 شماره
صفحات -
تاریخ انتشار 2013